Capacitated Domination Faster Than O(2n)
نویسندگان
چکیده
In this paper we consider the CAPACITATED DOMINATING SET problem — a generalisation of the DOMINATING SET problem where each vertex v is additionally equipped with a number c(v), which is the number of other vertices this vertex can dominate. We provide an algorithm that solves CAPACITATED DOMINATING SET exactly in O(1.89) time and polynomial space. Despite the fact that the CAPACITATED DOMINATING SET problem is quite similar to the DOMINATING SET problem, we are not aware of any published algorithms solving this problem faster than the straightforward O∗(2n)3 solution prior to this paper which was stated as an open problem at Dagstuhl seminar 08431 in 2008 and IWPEC 2008. We also provide an exponential approximation scheme for CAPACITATED DOMINATING SET which is a trade-off between the time complexity and the approximation ratio of the algorithm.
منابع مشابه
Beyond O*(2^n) in domination-type problems
In this paper we provide algorithms faster thanO(2) for several NP-complete dominationtype problems. More precisely, we provide: • an algorithm for CAPACITATED DOMINATING SET that solves it in O(1.89), • a branch-and-reducealgorithm solving LARGEST IRREDUNDANT SET inO(1.9657) time, • and a simple iterative-DFS algorithm for SMALLEST INCLUSION-MAXIMAL IRREDUNDANT SET that solves it in O(1.999956...
متن کاملOn Independent and (d, n)-domination numbers of hypercubes
In this paper we consider the (d, n)-domination number, γd,n(Qn), the distance-d domination number γd(Qn) and the connected distance-d domination number γc,d(Qn) of ndimensional hypercube graphs Qn. We show that for 2 ≤ d ≤ bn/2c, and n ≥ 4, γd,n(Qn) ≤ 2n−2d+2, improving the bound of Xie and Xu [19]. We also show that γd(Qn) ≤ 2n−2d+2−r, for 2 − 1 ≤ n − 2d + 1 < 2 − 1, and γc,d(Qn) ≤ 2n−d, for ...
متن کاملCapacitated Domination and Covering: A Parameterized Perspective
Capacitated versions of Vertex Cover and Dominating Set have been studied intensively in terms of polynomial time approximation algorithms. Although the problems Dominating Set and Vertex Cover have been subjected to considerable scrutiny in the parameterized complexity world, this is not true for their capacitated versions. Here we make an attempt to understand the behavior of the problems Cap...
متن کاملCapacitated Dominating Set on Planar Graphs
Capacitated Domination generalizes the classic Dominating Set problem by specifying for each vertex a required demand and an available capacity for covering demand in its closed neighborhood. The objective is to find a minimum-sized set of vertices that can cover all of the graph’s demand without exceeding any of the capacities. In this paper we look specifically at domination with hard-capacit...
متن کاملResults on Total Domination and Total Restrained Domination in Grid Graphs
A set S of vertices in a graph G(V,E) is called a total dominating set if every vertex v ∈ V is adjacent to an element of S. A set S of vertices in a graph G(V,E) is called a total restrained dominating set if every vertex v ∈ V is adjacent to an element of S and every vertex of V − S is adjacent to a vertex in V − S. The total domination number of a graph G denoted by γt(G) is the minimum card...
متن کامل